A second‐order ensemble method based on a blended backward differentiation formula timestepping scheme for time‐dependent Navier–Stokes equations

We present a second‐order ensemble method based on a blended three‐step backward differentiation formula (BDF) timestepping scheme to compute an ensemble of Navier–Stokes equations. Compared with the only existing second‐order ensemble method that combines the two‐step BDF timestepping scheme and a special explicit second‐order Adams–Bashforth treatment of the advection term, this method is more accurate with nominal increase in computational cost. We give comprehensive stability and error analysis for the method. Numerical examples are also provided to verify theoretical results and demonstrate the improved accuracy of the method. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 34–61, 2017     

一类非线性椭圆方程的刘维尔型定理

设（Mⁿ,g）是一个n维非紧的完备黎曼流行.本文考虑有正解的非线性椭圆方程△_fu+au log u=0的刘维尔型定理,其中a是一个非零常数.利用Bochner公式和极大值原理,获得了以上方程在Bakry-Emery里奇曲率有下界时正解的Li-Yau型梯度估计和某些有关的刘维尔理论,推广了文献[7]的结果.     

Evaluation of the quality consistency of powdered poppy capsule extractive by an averagely linear‐quantified fingerprint method in combination with antioxidant activities and two compounds analyses

A novel averagely linear‐quantified fingerprint method was proposed and successfully applied to monitor the quality consistency of alkaloids in powdered poppy capsule extractive. Averagely linear‐quantified fingerprint method provided accurate qualitative and quantitative similarities for chromatographic fingerprints of Chinese herbal medicines. The stability and operability of the averagely linear‐quantified fingerprint method were verified by the parameter r . The average linear qualitative similarity (improved based on conventional qualitative “Similarity”) was used as a qualitative criterion in the averagely linear‐quantified fingerprint method, and the average linear quantitative similarity was introduced as a quantitative one. was able to identify the difference in the content of all the chemical components. In addition, was found to be highly correlated to the contents of two alkaloid compounds (morphine and codeine). A simple flow injection analysis was developed for the determination of antioxidant capacity in Chinese Herbal Medicines, which was based on the scavenging of 2,2‐diphenyl‐1‐picrylhydrazyl radical by antioxidants. The fingerprint–efficacy relationship linking chromatographic fingerprints and antioxidant activities was investigated utilizing orthogonal projection to latent structures method, which provided important pharmacodynamic information for Chinese herbal medicines quality control. In summary, quantitative fingerprinting based on averagely linear‐quantified fingerprint method can be applied for monitoring the quality consistency of Chinese herbal medicines, and the constructed orthogonal projection to latent structures model is particularly suitable for investigating the fingerprint–efficacy relationship.     

An alternative proof of lower bounds for the first eigenvalue on manifolds

Recently, Andrews and Clutterbuck [1] gave a new proof of the optimal lower eigenvalue bound on manifolds via modulus of continuity for solutions of the heat equation. In this short note, we give an alternative proof of Theorem 2 in [1]. More precisely, following Ni's method (Section 6 of [5]), we give an elliptic proof of this theorem.     

Full Bayesian analysis of claims reserving uncertainty

We revisit the gamma–gamma Bayesian chain-ladder (BCL) model for claims reserving in non-life insurance. This claims reserving model is usually used in an empirical Bayesian way using plug-in estimates for the variance parameters. The advantage of this empirical Bayesian framework is that allows us for closed form solutions. The main purpose of this paper is to develop the full Bayesian case also considering prior distributions for the variance parameters and to study the resulting sensitivities.     

Analysis of the mean squared derivative cost function

In this paper, we investigate the mean squared derivative cost functions that arise in various applications such as in motor control, biometrics and optimal transport theory. We provide qualitative properties, explicit analytical formulas and computational algorithms for the cost functions. We also perform numerical simulations to illustrate the analytical results. In addition, as a by‐product of our analysis, we obtain an explicit formula for the inverse of a Wronskian matrix that is of independent interest in linear algebra and differential equations theory. Copyright © 2017 John Wiley & Sons, Ltd.     

A unifying theory of exactness of linear penalty functions II: parametric penalty functions

In this article, we develop a general theory of exact parametric penalty functions for constrained optimization problems. The main advantage of the method of parametric penalty functions is the fact that a parametric penalty function can be both smooth and exact unlike the standard (i.e. non-parametric) exact penalty functions that are always nonsmooth. We obtain several necessary and/or sufficient conditions for the exactness of parametric penalty functions, and for the zero duality gap property to hold true for these functions. We also prove some convergence results for the method of parametric penalty functions, and derive necessary and sufficient conditions for a parametric penalty function to not have any stationary points outside the set of feasible points of the constrained optimization problem under consideration. In the second part of the paper, we apply the general theory of exact parametric penalty functions to a class of parametric penalty functions introduced by Huyer and Neumaier, and to smoothing approximations of nonsmooth exact penalty functions. The general approach adopted in this article allowed us to unify and significantly sharpen many existing results on parametric penalty functions.     

A new robust DEA model and super-efficiency measure

Applications of traditional data envelopments analysis (DEA) models require knowledge of crisp input and output data. However, the real-world problems often deal with imprecise or ambiguous data. In this paper, the problem of considering uncertainty in the equality constraints is analyzed and by using the equivalent form of CCR model, a suitable robust DEA model is derived in order to analyze the efficiency of decision-making units (DMUs) under the assumption of uncertainty in both input and output spaces. The new model based on the robust optimization approach is suggested. Using the proposed model, it is possible to evaluate the efficiency of the DMUs in the presence of uncertainty in a fewer steps compared to other models. In addition, using the new proposed robust DEA model and envelopment form of CCR model, two linear robust super-efficiency models for complete ranking of DMUs are proposed. Two different case studies of different contexts are taken as numerical examples in order to compare the proposed model with other approaches. The examples also illustrate various possible applications of new models.     

Nonhomogeneous multiparameter problems in Orlicz–Sobolev spaces

This paper is concerned with the existence and multiplicity of solutions for a class of problems involving the Φ-Laplacian operator with general assumptions on the nonlinearities, which include both semipositone cases and critical concave convex problems. The research is based on the subsupersolution technique combined with a truncation argument and an application of the Mountain Pass Theorem. The results in this paper improve and complement some recent contributions to this field.     

A Finite Volume Method Preserving Maximum Principle for the Conjugate Heat Transfer Problems with General Interface Conditions

In this paper, we present a unified finite volume method preserving discrete maximum principle (DMP) for the conjugate heat transfer problems with general interface conditions. We prove the existence of the numerical solution and the DMP-preserving property. Numerical experiments show that the nonlinear iteration numbers of the scheme in [24] increase rapidly when the interfacial coefficients decrease to zero. In contrast, the nonlinear iteration numbers of the unified scheme do not increase when the interfacial coefficients decrease to zero, which reveals that the unified scheme is more robust than the scheme in [24]. The accuracy and DMP-preserving property of the scheme are also veried in the numerical experiments.